package leetcode.剑指offer.前40;

import org.junit.Test;

import java.util.*;
import java.util.concurrent.CountDownLatch;

/**
 * @author ：zsy
 * @date ：Created 2021/7/24 11:23
 * @description：https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/
 */
public class 剑指_17_打印从1到最大的n位数 {
    @Test
    public void test() {
        Solution solution = new Solution();
        System.out.println(Arrays.toString(solution.printNumbers(5)));
    }

    class Solution {
        public int[] printNumbers(int n) {
            return null;
        }
    }

}
